import java.util.*;

public class Test31 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long x = in.nextLong();
        long tmp = x;

        int[] a = new int[18];
        int i = 0;
        while (tmp != 0) {
            int m = (int) tmp % 10;
            a[i++] = m;
            tmp /= 10;
        }

        Arrays.sort(a);

        int[] dp = new int[18];
        int k=0;
        while(a[k] == 0) k++;
        int left = k;
        dp[0] = 0;
        int ret=0;
        i=k;
        while (i < 18) {
            left=k;
            int sum = 0;
            sum += a[i];
            ret+=a[i];
            while (left < i) {
                if (sum*2 == ret) {
                    dp[i] = dp[i - 1] + 1;
                    break;
                }
                sum += a[left++];
            }
            if(dp[i] == 0 ) dp[i]=dp[i-1];
            i++;
        }

        if (dp[17] != 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }








    public static void main02(String[] args) {
        Scanner in = new Scanner(System.in);
        int T = in.nextInt();
        while (T-- != 0) {
            long n = in.nextLong();
            long a = in.nextLong();
            long b = in.nextLong();

            long ret = Long.MAX_VALUE;

            //  双人船的个数
            long k = ( n % 2 == 0) ? (n / 2) : (n / 2 + 1) ;
            for (long x = 0; x <= k; x++) {
                long y = ((n - 2 * x) % 3 == 0 ) ? ((n - 2 * x) / 3) : ((n - 2 * x) / 3 + 1);
                long  max=x * a + y * b ;
                ret = Math.min(max, ret);
            }

            System.out.println(ret);
        }
    }









    public static void main01(String[] args) {
        Scanner in = new Scanner(System.in);
        int n=in.nextInt();
        int k=in.nextInt();
        PriorityQueue<Integer> queue=new PriorityQueue<>(n);
        for(int i=0;i<n;i++){
            queue.add(in.nextInt());
        }
        int sum=0;
        int count=0;
        while(sum < k){
            int cur= queue.poll();
            sum+=cur;
            count++;

            queue.add(2*cur);
        }
        if(sum == k){
            System.out.println(count);
        }else{
            System.out.println(count-1);
        }
    }
}
